A Hidden-Line Algorithm for Hyperspace
نویسندگان
چکیده
منابع مشابه
A Hidden-Line Algorithm for Hyperspace
An object-space hidden-line algorithm for higher-dimensional scenes has been designed and implemented. Scenes consist of convex hulls of any dimension, each of which is compared against the edges of all convex hulls not eliminated by a hyperdimensional clipper, a depth test after sorting and a minimax text. Hidden and visible elements are determined in accordance with the dimensionality of the ...
متن کاملA Hidden Line Algorithm For Halftone Picture Representation !
Advanced Research Projects Agency Department of Defense ARPA order 829 Program code number6D30 Technical Report 4-5 John E. Warnock A HIDDEN LINE ALC~RITHH fOR HALFTONE PICTURE REPRESENTATION
متن کاملA Simple and Efficient Haloed Line Algorithm for Hidden Line Elimination
1. Introduction An efficient algorithm, HALO, is given to compute haloed line drawings of wire frame objects. (Haloed line drawings are described by Appel et al. 1 HALO has two parts: CUT and DRAW. CUT uses an adaptive grid to find all edge intersections. It overlays a square grid, whose fineness is a function of As computer aided design (CAD) deals with more complicated databases, it becomes c...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملOn the two array mask hidden-line algorithm
This paper considers the Two Array Mask algorithm which enables rapid plotting of a continuous function F(x, y). After reexamining this method as a hidden-surface algorithm, its correctness and precision were analyzed for parallel and perspective projections; given that the method with perspective projections is, generally speaking, not exact, alternative solutions are proposed for this case.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1982
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0211006